Generalized Canonical Polyadic Tensor Decomposition
نویسندگان
چکیده
منابع مشابه
Analysis and Approximation of the Canonical Polyadic Tensor Decomposition
We study the least-squares (LS) functional of the canonical polyadic (CP) tensor decomposition. Our approach is based on the elimination of one factor matrix which results in a reduced functional. The reduced functional is reformulated into a projection framework and into a Rayleigh quotient. An analysis of this functional leads to several conclusions: new sufficient conditions for the existenc...
متن کاملCanonical Polyadic Decomposition with Orthogonality Constraints
Canonical Polyadic Decomposition (CPD) of a higher-order tensor is an important tool in mathematical engineering. In many applications at least one of the matrix factors is constrained to be column-wise orthonormal. We first derive a relaxed condition that guarantees uniqueness of the CPD under this constraint and generalize the result to the case where one of the factor matrices has full colum...
متن کاملCanonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
Now, the statement (i) follows from (S.1.3) by setting y = x. (ii) Since the vectors ci1 , . . . , ciK−1 are linearly independent in R , it follows that there exists a vector y such that det [ ci1 . . . ciK−1 y ] 6= 0. Hence, by (S.1.3), the (i1, . . . , iK−1)-th column of B(C) is nonzero. (iii) follows from (S.1.3) and the fact that det [ ci1 . . . ciK−1 y ] = 0 if and only if y ∈ span{ci1 , ....
متن کاملOptimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-(Lr, Lr, 1) Terms, and a New Generalization
The canonical polyadic and rank-(Lr , Lr , 1) block term decomposition (CPD and BTD, respectively) are two closely related tensor decompositions. The CPD and, recently, BTD are important tools in psychometrics, chemometrics, neuroscience, and signal processing. We present a decomposition that generalizes these two and develop algorithms for its computation. Among these algorithms are alternatin...
متن کاملCanonical Polyadic Decomposition with a Columnwise Orthonormal Factor Matrix
Canonical Polyadic Decomposition (CPD) of a higher-order tensor is an important tool in mathematical engineering. In many applications at least one of the matrix factors is constrained to be column-wise orthonormal. We first derive a relaxed condition that guarantees uniqueness of the CPD under this constraint. Second, we give a simple proof of the existence of the optimal low-rank approximatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Review
سال: 2020
ISSN: 0036-1445,1095-7200
DOI: 10.1137/18m1203626